Restricted homogeneity implies bi-additivity

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homogeneity of spacetime implies the free Schrödinger equation

The free Schrödinger equation is shown to be a consequence of spacetime homogeneity in the non-relativistic domain. This may help understand the origin of the wave equations in quantum theory.

متن کامل

Restricted Strong Convexity Implies Weak Submodularity

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarant...

متن کامل

k-Additivity and C-decomposability of bi-capacities and its integral

k-Additivity is a convenient way to have less complex (bi-)capacities. This paper gives a new characterization of k-additivity, introduced by Grabisch and Labreuche, of bi-capacities and contrasts between the existing characterization and the new one, that differs from the one of Saminger and Mesiar. Besides, in the same way for capacities, a concept of C-decomposability, distinct from the prop...

متن کامل

Additivity and non-additivity for perverse signatures

A well-known property of the signature of closed oriented 4n-dimensional manifolds is Novikov additivity, which states that if a manifold is split into two manifolds with boundary along an oriented smooth hypersurface, then the signature of the original manifold equals the sum of the signatures of the resulting manifolds with boundary. Wall showed that this property is not true of signatures on...

متن کامل

Bi-criteria and approximation algorithms for restricted matchings

In this work we study approximation algorithms for the Bounded Color Matching problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge e has a color ce and a profit pe ∈ Q, we want to compute a maximum (cardinality or profit) matching in which no more than wj ∈ Z edges of color cj are present. This kind of problems, beside the theoretical intere...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Polonici Mathematici

سال: 1988

ISSN: 0066-2216,1730-6272

DOI: 10.4064/ap-48-2-121-125